Rapid Visualization of B Specifications containing Higher-Order Recursive Functions

نویسندگان

  • Jens Bendisposto
  • Michael Leuschel
چکیده

The B-method [1] is a theory and methodology for formal development of computer systems. It is used in industry in a range of critical domains. In addition to the proof activities it is increasingly being realised that validation of the initial specification is important, as otherwise a correct implementation of an incorrect specification is being developed. This validation can come in the form of animation, e.g., to check that certain functionality is present in the specification. Another useful tool is model checking, whereby the specification can be systematically checked for certain temporal properties. In previous work [2], we have presented the ProB animator and model checker to support those activities. In this work we present two important improvements upon previous work. First, realistic specifications often contain complicated functions. Take the following excerpt of a specification (translated from a Z specification given to us by Anthony Hall):

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Validating and Animating Higher-Order Recursive Functions in B

ProB is an animation and model checking tool for the B Method, which can deal with many interesting specifications. Some specifications, however, contain complicated functions which cannot be represented explicitly by a tool. We present a scheme with which higher-order recursive functions can be encoded in B, and establish soundness of this scheme. We then describe a symbolic representation for...

متن کامل

Validating Z Specifications Using the ProBAnimator and Model Checker

We present the architecture and implementation of the proz tool to validate high-level Z specifications. The tool was integrated into prob, by providing a translation of Z into B and by extending the kernel of prob to accommodate some new syntax and data types. We describe the challenge of going from the tool friendly formalism B to the more specification-oriented formalism Z, and show how many...

متن کامل

Parser Combinators for Ambiguous Left-Recursive Grammars

Parser combinators are higher-order functions used to build parsers as executable specifications of grammars. Some existing implementations are only able to handle limited ambiguity, some have exponential time and/or space complexity for ambiguous input, most cannot accommodate left-recursive grammars. This paper describes combinators, implemented in Haskell, which overcome all of these limitat...

متن کامل

Executing Higher Order Logic

We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed. Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unificat...

متن کامل

Facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specification is a difficult task. This paper presents the formal software specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC relies on a new kind of recursive functions, i. e. recursive functions on context-free langua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Softwaretechnik-Trends

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2006